First-order reasoning for higher-order concurrency
نویسندگان
چکیده
منابع مشابه
First-order reasoning for higher-order concurrency
We present a practical first-order theory of a higher-order ⇡-calculus which is both sound and complete with respect to a standard semantic equivalence. The theory is a product of combining and simplifying two of the most prominent theories for HO⇡ of Sangiorgi et al. and Je↵rey and Rathke [10, 21], and a novel approach to scope extrusion. In this way we obtain an elementary labelled transition...
متن کاملHigher-Order Concurrency in PVM
Message-passing systems are typically used to achieve high-performance parallel computing. In this paper we examine how advanced concurrent programming can be achieved using existing message-passing systems. In particular, we look at Reppy's extension to Hoare's basic CSP model, called higher-order concurrency, where communication events (such as send, receive and non-deterministic choice) are ...
متن کاملGame Semantics for Higher-Order Concurrency
We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on locally declared channels. This develops previous work which interpreted freshly generated names in a category of games acted upon by the group of natural number automorphisms, by showing how names may be associated with “dependent ...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملNonmonotonic Reasoning for First - Order
The stable model semantics and the well-founded semantics are usually considered for programs with rules of the simple structure, which is a consequence of literals. We generalize these semantics for rst-order programs. We proof properties of these semantics, particular relations with minimal models and equivalent transformations. Besides, we investigate the possibilities of reducing rst-order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Languages, Systems & Structures
سال: 2012
ISSN: 1477-8424
DOI: 10.1016/j.cl.2012.04.003